Wave Packet Pseudomodes of Variable Coefficient Differential Operators

The pseudospectra of nonselfadjoint linear ordinary differential operators with variable coefficients are considered. It is shown that when a certain winding number or twist condition is satisfied, closely related to Hörmander's commutator condition for partial differential equations, \varepsilon-pseudoeigenfunctions of such operators for exponentially small values of \varepsilon exist in the form of localized wave packets. In contrast to related results of Davies and of Dencker, Sjöstrand, and Zworski, the symbol need not be smooth

Ten Digit Algorithms

This paper was presented as the A R Mitchell Lecture at the 2005 Dundee Biennial Conference on Numerical Analysis, 27 June 2005

Predictions for Scientific Computing Fifty Years from Now

This essay is adapted from a talk given June 17, 1998 at the conference "Numerical Analysis and Computers - 50 Years of Progress" held at the University of Manchester, England in commemoration of the 50th anniversary of the Mark 1 computer

Householder triangularization of a quasimatrix

A standard algorithm for computing the QR factorization of a matrix A is Householder triangularization. Here this idea is generalized to the situation in which A is a quasimatrix, that is, a “matrix” whose “columns” are functions defined on an interval [a,b]. Applications are mentioned to quasimatrix leastsquares fitting, singular value decomposition, and determination of ranks, norms, and condition numbers, and numerical illustrations are presented using the chebfun system

Is Gauss quadrature better than Clenshaw-Curtis?

We consider the question of whether Gauss quadrature, which is very famous, is more powerful than the much simpler Clenshaw-Curtis quadrature, which is less well-known. Seven-line MATLAB codes are presented that implement both methods, and experiments show that the supposed factor-of-2 advantage of Gauss quadrature is rarely realized. Theorems are given to explain this effect. First, following Elliott and O'Hara and Smith in the 1960s, the phenomenon is explained as a consequence of aliasing of coefficients in Chebyshev expansions. Then another explanation is offered based on the interpretation of a quadrature formula as a rational approximation of $\log((z+1)/(z-1))$ in the complex plane. Gauss quadrature corresponds to Pad\'e approximation at $z=\infty$. Clenshaw-Curtis quadrature corresponds to an approximation whose order of accuracy at $z=\infty$ is only half as high, but which is nevertheless equally accurate near $[-1,1]$

Ten Digit Problems

Most quantitative mathematical problems cannot be solved exactly, but there are powerful algorithms for solving many of them numerically to a specified degree of precision like ten digits or ten thousand. In this article three difficult problems of this kind are presented, and the story is told of the SIAM 100-Dollar, 100-Digit Challenge. The twists and turns along the way illustrate some of the flavor of algorithmic continuous mathematics

Numerical Analysis

Acknowledgements: This article will appear in the forthcoming Princeton Companion to Mathematics, edited by Timothy Gowers with June Barrow-Green, to be published by Princeton University Press.\ud \ud In preparing this essay I have benefitted from the advice of many colleagues who corrected a number of errors of fact and emphasis. I have not always followed their advice, however, preferring as one friend put it, to "put my head above the parapet". So I must take full responsibility for errors and omissions here.\ud \ud With thanks to: Aurelio Arranz, Alexander Barnett, Carl de Boor, David Bindel, Jean-Marc Blanc, Mike Bochev, Folkmar Bornemann, Richard Brent, Martin Campbell-Kelly, Sam Clark, Tim Davis, Iain Duff, Stan Eisenstat, Don Estep, Janice Giudice, Gene Golub, Nick Gould, Tim Gowers, Anne Greenbaum, Leslie Greengard, Martin Gutknecht, Raphael Hauser, Des Higham, Nick Higham, Ilse Ipsen, Arieh Iserles, David Kincaid, Louis Komzsik, David Knezevic, Dirk Laurie, Randy LeVeque, Bill Morton, John C Nash, Michael Overton, Yoshio Oyanagi, Beresford Parlett, Linda Petzold, Bill Phillips, Mike Powell, Alex Prideaux, Siegfried Rump, Thomas Schmelzer, Thomas Sonar, Hans Stetter, Gil Strang, Endre Süli, Defeng Sun, Mike Sussman, Daniel Szyld, Garry Tee, Dmitry Vasilyev, Andy Wathen, Margaret Wright and Steve Wright

A trapezoidal rule error bound unifying the Euler–Maclaurin formula and geometric convergence for periodic functions

The error in the trapezoidal rule quadrature formula can be attributed to discretization in the interior and non-periodicity at the boundary. Using a contour integral, we derive a unified bound for the combined error from both sources for analytic integrands. The bound gives the Euler–Maclaurin formula in one limit and the geometric convergence of the trapezoidal rule for periodic analytic functions in another

Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integrals

Among the fastest methods for solving stiff PDE are exponential integrators, which require the evaluation of $f(A)$, where $A$ is a negative definite matrix and $f$ is the exponential function or one of the related ``$\varphi$ functions'' such as $\varphi_1(z) = (e^z-1)/z$. Building on previous work by Trefethen and Gutknecht, Gonchar and Rakhmanov, and Lu, we propose two methods for the fast evaluation of $f(A)$ that are especially useful when shifted systems $(A+zI)x=b$ can be solved efficiently, e.g. by a sparse direct solver. The first method method is based on best rational approximations to $f$ on the negative real axis computed via the Carathéodory-Fejér procedure, and we conjecture that the accuracy scales as $(9.28903\dots)^{-2n}$, where $n$ is the number of complex matrix solves. In particular, three matrix solves suffice to evaluate $f(A)$ to approximately six digits of accuracy. The second method is an application of the trapezoid rule on a Talbot-type contour